Integrating Process Planning, WATC Weighted Scheduling, and WPPW Weighted Due-Date Assignment Using Pure and Hybrid Metaheuristics for Weighted Jobs
نویسندگان
چکیده
منابع مشابه
Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods
Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of ...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولMinimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
In this paper, an integrated due date assignment, and delivery scheduling of order for multi customer for make to order production system in supply chain has been survered. One manufacture received n orders from K customers. The due date of orders for each customer is common and manufacture can assign the due dates with a related cost. Orders must be process by one machine and send to customers...
متن کاملRobust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
We consider the class of single machine scheduling problems with the objective to minimize the weighted number of late jobs, under the assumption that completion due-dates are not known precisely at the time when decisionmaker must provide a schedule. It is assumed that only the intervals to which the due-dates belong are known. The concept of maximum regret is used to define robust solution. A...
متن کاملMetaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs
This paper considers the scheduling of n jobs on m parallel machines to minimize the weighted number of early and tardy jobs. The single machine case of this problem has been shown to be NPcomplete in the strong sense. This problem on m parallel machine is also NP complete in the strong sense and finding an optimal solution appears unlikely. The problem is formulated as an integer linear progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational and Experimental Science and Engineering
سال: 2017
ISSN: 2149-9144
DOI: 10.22399/ijcesen.323860